Numerical method for solving optimal control problem of the linear differential systems with inequality constraints

نویسندگان

  • Afsun Hamzeh Faculty of Mathematical Sciences and Statistics, Malayer University, P. O. Box 65719-95863, Malayer, Iran
  • Farshid Mirzaee Faculty of Mathematical Sciences and Statistics, Malayer University, P. O. Box 65719-95863, Malayer, Iran
چکیده مقاله:

In this paper, an efficient method for solving optimal control problems of the linear differential systems with inequality constraint is proposed. By using new adjustment of hat basis functions and their operational matrices of integration, optimal control problem is reduced to an optimization problem. Also, the error analysis of the proposed method is nvestigated and it is proved that the order of convergence is O(h4). Finally, numerical examples affirm the efficiency of the proposed method.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

numerical method for solving optimal control problem of the linear differential systems with inequality constraints

in this paper, an efficient method for solving optimal control problemsof the linear differential systems with inequality constraint is proposed. by usingnew adjustment of hat basis functions and their operational matrices of integration,optimal control problem is reduced to an optimization problem. also, the erroranalysis of the proposed method is investigated and it is proved that the order o...

متن کامل

the algorithm for solving the inverse numerical range problem

برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.

15 صفحه اول

A New Method for Solving the Fully Interval Bilevel Linear Programming Problem with Equal Constraints

Most research on bilevel linear programming problem  is focused on its deterministic form, in which the coefficients and decision variables in the objective functions and constraints are assumed to be crisp. In fact, due to inaccurate information, it is difficult to know exactly values of coefficients that used to construct a bilevel model. The interval set theory is suitable for describing and...

متن کامل

A hybrid method with optimal stability properties for the numerical solution of stiff differential systems

In this paper, we consider the construction of a new class of numerical methods based on the backward differentiation formulas (BDFs) that be equipped by including two off--step points. We represent these methods from general linear methods (GLMs) point of view which provides an easy process to improve their stability properties and implementation in a variable stepsize mode. These superioritie...

متن کامل

Using an Efficient Penalty Method for Solving Linear Least Square Problem with Nonlinear Constraints

In this paper, we use a penalty method for solving the linear least squares problem with nonlinear constraints. In each iteration of penalty methods for solving the problem, the calculation of projected Hessian matrix is required. Given that the objective function is linear least squares, projected Hessian matrix of the penalty function consists of two parts that the exact amount of a part of i...

متن کامل

منابع من

با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ذخیره در منابع من قبلا به منابع من ذحیره شده

{@ msg_add @}


عنوان ژورنال

دوره 4  شماره 3

صفحات  230- 248

تاریخ انتشار 2016-07-01

با دنبال کردن یک ژورنال هنگامی که شماره جدید این ژورنال منتشر می شود به شما از طریق ایمیل اطلاع داده می شود.

میزبانی شده توسط پلتفرم ابری doprax.com

copyright © 2015-2023